Rules Dependencies in Backward Chaining of Conceptual Graphs Rules
نویسندگان
چکیده
Conceptual Graphs Rules were proposed as an extension of Simple Conceptual Graphs (CGs) to represent knowledge of form “if A then B”, where A and B are simple CGs. Optimizations of the deduction calculus in this KR formalism include a Backward Chaining that unifies at the same time whole subgraphs of a rule, and a Forward Chaining that relies on compiling dependencies between rules. In this paper, we show that the unification used in the first algorithm is exactly the operation required to compute dependencies in the second one. We also combine the benefits of the two approaches, by using the graph of rules dependencies in a Backward Chaining framework.
منابع مشابه
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order logics, without function symbols. Sound and complete reasonings w.r.t. associated logic formulas are obtained through a kind of graph homomorphism called projection. Conceptual Graphs Rules (or CG rules) are a standard ext...
متن کاملOn rules with existential variables: Walking the decidability line
We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as conjunctive query answering or entailment) undecidable. These rules, called ∀∃-rules, have the same logical form as tuple-generating dependencies in databases and as conceptual graph rules. The aim of this paper is to provide a clearer picture of the frontier b...
متن کاملPiece Resolution : Towards Larger
This paper focuses on two aspects of piece resolution in backward chaining for conceptual graph rules 13]. First, as conceptual graphs admit a rst-order logic interpretation, inferences can be proven by classical theorem provers. Nevertheless, they do not use the notion of piece, which is a graph notion. So we deene piece resolution over a class of rst-order logical formulae: the logical rules....
متن کاملExtending Decidable Cases for Rules with Existential Variables
In ∀∃-rules, the conclusion may contain existentially quantified variables, which makes reasoning tasks (as deduction) non-decidable. These rules have the same logical form as TGD (tuplegenerating dependencies) in databases and as conceptual graph rules. We extend known decidable cases by combining backward and forward chaining schemes, in association with a graph that captures exactly the noti...
متن کاملSome Structural Properties of the Logic of Rules
We study the properties of semantic consequence in a particular subset of first-order logic with equality and no function symbols, under the unique name assumption. Formulas in this subset of logic are rules of form ∀~x(H → ∃~yC) where the hypothesis H and the conclusion C are conjunctions of atoms (possibly with equality), ~x contains the variables in H and ~y the variables in C that are not i...
متن کامل